A survey of models and algorithms for winter road maintenance. Part III: Vehicle routing and depot location for spreading
نویسندگان
چکیده
Winter road maintenance planning involves a variety of decision-making problems related to the routing of vehicles for spreading chemicals and abrasives, for plowing roadways and sidewalks, for loading snow into trucks, and for transporting snow to disposal sites. These problems are very difficult and site specific because of the diversity of operating conditions influencing the conduct of winter road maintenance operations and the wide variety of operational constraints. As the third of a four-part survey, this paper reviews optimization models and solution algorithms for the routing of vehicles for spreading operations. We also review models for the location of vehicle and materials depots and for the assignment of crews to vehicle depots. The two first parts of the survey address system design problems for winter road maintenance. The fourth part of the survey covers vehicle routing problems for plowing and snow disposal operations. 2005 Elsevier Ltd. All rights reserved.
منابع مشابه
A survey of models and algorithms for winter road maintenance. Part IV: Vehicle routing and fleet sizing for plowing and snow disposal
This is the last part of a four-part survey of optimization models and solution algorithms for winter road maintenance planning. The two first parts of the survey address system design problems for winter road maintenance. The third part concentrates mainly on vehicle routing problems for spreading operations. The aim of this paper is to provide a comprehensive survey of optimization models and...
متن کاملSolving a multi-depot location-routing problem with heterogeneous vehicles and fuzzy travel times by a meta-heuristic algorithm
A capacitated location-routing problem (CLRP) is one of the new areas of research in distribution management. It consists of two problems; locating of facilities and routing of the vehicle with a specific capacity. The purpose of the CLRP is to open a set of stores, allocate customers to established deposits, and then design vehicle tours in order to minimize the total cost. In this paper, a ne...
متن کاملAn Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملA Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version
Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 34 شماره
صفحات -
تاریخ انتشار 2007